An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
نویسندگان
چکیده
منابع مشابه
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
Abstract. This paper presents a new edge-swap heuristic for generating spanning trees with a minimum number of branch vertices, i.e. vertices of degree greater than two. This problem was introduced in Gargano et al. (2002) and has been called the minimum branch vertices (MBV) problem by Cerulli et al. (2009). The heuristic starts with a random spanning tree and iteratively reduces the number of...
متن کاملSpanning trees with few branch vertices
A branch vertex in a tree is a vertex of degree at least three. We prove that, for all s ≥ 1, every connected graph on n vertices with minimum degree at least ( 1 s+3 + o(1))n contains a spanning tree having at most s branch vertices. Asymptotically, this is best possible and solves a problem of Flandrin, Kaiser, Kuz̆el, Li and Ryjác̆ek, which was originally motivated by an optimization problem i...
متن کاملSpanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph
Let k be a non-negative integer. A branch vertex of a tree is a vertex of degree at least three. We show two sufficient conditions for a connected clawfree graph to have a spanning tree with a bounded number of branch vertices: (i) A connected claw-free graph has a spanning tree with at most k branch vertices if its independence number is at most 2k + 2. (ii) A connected clawfree graph of order...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملAn effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
Given a graph G = (V,E), the minimum branch vertices problem consists in finding a spanning tree T = (V,E′) of G minimizing the number of vertices with degree greater than two. We consider a simple combinatorial lower bound for the problem, from which we propose a decomposition approach. The motivation is to break down the problem into several smaller subproblems which are more tractable comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2013
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-013-0665-y